package com.dyz.leetcode._14_binarySearchTree;

import com.dyz.leetcode.TreeNode;

public class _617_mergeTrees {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if(root1==null){return root2;}
        if(root2==null){return root1;}

        TreeNode newNode = new TreeNode(root1.val+root2.val);

        TreeNode left = mergeTrees(root1.left, root2.left);
        TreeNode right = mergeTrees(root1.right, root2.right);

        newNode.left = left;
        newNode.right = right;
        return newNode;
    }
}
